external sort - перевод на арабский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

external sort - перевод на арабский

CLASS OF SORTING ALGORITHMS THAT CAN HANDLE MASSIVE AMOUNTS OF DATA
External sort; External merge; External Sorting; On-disk merge; On disk merge

external sort         
تصنيف خارجي
bubble sort         
  • An example of bubble sort. Starting from the beginning of the list, compare every adjacent pair, swap their position if they are not in the right order (the latter one is smaller than the former one). After each [[iteration]], one less element (the last one) is needed to be compared until there are no more elements left to be compared.
  • Bubble sort. The list was plotted in a Cartesian coordinate system, with each point (''x'', ''y'') indicating that the value ''y'' is stored at index ''x''. Then the list would be sorted by bubble sort according to every pixel's value. Note that the largest end gets sorted first, with smaller elements taking longer to move to their correct positions.
SIMPLE SORTING ALGORITHM
Bubble sort/C; Bubblesort; Worst case bubble sort; Bubble sort algorithm; BubbleSort; Sinking sort; Sink sort; Bubble Sort
ترتيب فقاعى
quicksort         
  • ''O''(''n''<sup>2</sup>)}}) on ''already sorted'' arrays, or arrays of identical elements. Since sub-arrays of sorted / identical elements crop up a lot towards the end of a sorting procedure on a large set, versions of the quicksort algorithm that choose the pivot as the middle element run much more quickly than the algorithm described in this diagram on large sets of numbers.
  • An animated demonstration of Quicksort using Hoare's partition scheme. The red outlines show the positions of the left and right pointers (<code>i</code> and <code>j</code> respectively), the black outlines show the positions of the sorted elements, and the filled black square shows the value that is being compared to (<code>pivot</code>).
DIVIDE AND CONQUER SORTING ALGORITHM
Quick sort; QuickSort; Quick Sort; Randomized quicksort; Hoaresort; Balanced quicksort; External quicksort; Quick3; Quick3 sort; Parallel quicksort; Partition-exchange sort; Partition exchange sort
فَرْزٌ سريعٌ

Определение

bubble sort
A sorting technique in which pairs of adjacent values in the list to be sorted are compared and interchanged if they are out of order; thus, list entries "bubble upward" in the list until they bump into one with a lower sort value. Because it is not very good relative to other methods and is the one typically stumbled on by naive and untutored programmers, hackers consider it the canonical example of a naive algorithm. The canonical example of a really *bad* algorithm is bogo-sort. A bubble sort might be used out of ignorance, but any use of bogo-sort could issue only from brain damage or willful perversity. [Jargon File]

Википедия

External sorting

External sorting is a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data being sorted do not fit into the main memory of a computing device (usually RAM) and instead they must reside in the slower external memory, usually a disk drive. Thus, external sorting algorithms are external memory algorithms and thus applicable in the external memory model of computation.

External sorting algorithms generally fall into two types, distribution sorting, which resembles quicksort, and external merge sort, which resembles merge sort. External merge sort typically uses a hybrid sort-merge strategy. In the sorting phase, chunks of data small enough to fit in main memory are read, sorted, and written out to a temporary file. In the merge phase, the sorted subfiles are combined into a single larger file.